Handling owl:sameAs in RDFox via Rewriting
نویسندگان
چکیده
RDFox is a scalable, centralised, main-memory, multi-core RDF system that supports materialisation-based reasoning in OWL 2 RL and SWRL. Reasoning with the owl:sameAs property using the OWL 2 RL/RDF rules can be very inefficient, so in this paper we extend RDFox to handle owl:sameAs via rewriting—replacing equal resources with a single representative. The main challenge in applying this well-known idea is to effectively parallelise processing. We also show that answering SPARQL queries over the rewritten triples is not straightforward due to the multiset semantics and builtin functions. Finally, we empirically show that, on data sets commonly used in practice, rewriting can reduce materialisation times and memory consumption by orders of magnitude.
منابع مشابه
RDFox: A Highly-Scalable RDF Store
We present RDFox—a main-memory, scalable, centralised RDF store that supports materialisation-based parallel datalog reasoning and SPARQL query answering. RDFox uses novel and highly-efficient parallel reasoning algorithms for the computation and incremental update of datalog materialisations with efficient handling of owl:sameAs. In this system description paper, we present an overview of the ...
متن کاملHandling Owl: sameAs via Rewriting
Rewriting is widely used to optimise owl:sameAs reasoning in materialisation based OWL 2 RL systems. We investigate issues related to both the correctness and efficiency of rewriting, and present an algorithm that guarantees correctness, improves efficiency, and can be effectively parallelised. Our evaluation shows that our approach can reduce reasoning times on practical data sets by orders of...
متن کاملowl:sameAs and Linked Data: An Empirical Study
Linked Data is a steadily growing presence on the Web. In Linked Data, the description of resources can be obtained incrementally by dereferencing the URIs of resources via the HTTP protocol. The use of owl:sameAs further enriches the Linked Data space by declaratively supporting distributed semantic data integration at the instance level. When consuming Linked Data, users should be careful whe...
متن کاملStrider-lsa: Massive RDF Stream Reasoning in the Cloud
Reasoning over semantically annotated data is an emerging trend in stream processing aiming to produce sound and complete answers to a set of continuous queries. It usually comes at the cost of finding a trade-off between data throughput and the cost of expressive inferences. Striderlsa proposes such a trade-off and combines a scalable RDF stream processing engine with an efficient reasoning sy...
متن کاملAnalyzing Graph Transformation Systems through Constraint Handling Rules
Graph transformation systems (GTS) and constraint handling rules (CHR) are nondeterministic rule-based state transition systems. CHR is well-known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS, and provide a program equ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014